An Axiomatisation of Computationally Adequate Domain Theoretic Models of FPC
نویسندگان
چکیده
Categorical models of the metalanguage FPC (a type theory with sums, products, exponentials and recursive types) are defined. Then, domain-theoretic models of FPC are axiomatised and a wide subclass of them —the non-trivial and absolute ones— are proved to be both computationally sound and adequate. Examples include: the category of cpos and partial continuous functions and functor categories over it.
منابع مشابه
An Axiomatization of Computationally Adequate Domain Theoretic Models of FPC
Synopsis Categorical models of the metalanguage FPC (a type theory with sums, products, exponentials and recursive types) are deened. Then, domain-theoretic models of FPC are axiomatised and a wide subclass of them |the non-trivial and absolute ones| are proved to be both computationally sound and adequate. Examples include: the category of cpos and partial continuous functions and functor cate...
متن کاملInterpreting Polymorphic FPC into Domain Theoretic Models of Parametric Polymorphism
This paper shows how parametric PILLY (Polymorphic Intuitionistic / Linear Lambda calculus with a fixed point combinator Y ) can be used as a metalanguage for domain theory, as originally suggested by Plotkin more than a decade ago. Using recent results about solutions to recursive domain equations in parametric models of PILLY , we show how to interpret FPC in these. Of particular interest is ...
متن کاملFrom parametric polymorphism to models of polymorphic FPC
This paper shows how PILLY (Polymorphic Intuitionistic / Linear Lambda calculus with a fixed point combinator Y ) with parametric polymorphism can be used as a metalanguage for domain theory, as originally suggested by Plotkin more than a decade ago. Using Plotkin’s encodings of recursive types in PILLY we show how parametric models of PILLY give rise to models of FPC, a simply typed lambda cal...
متن کاملComputational Adequacy for Recursive Types in Models of Intuitionistic Set Theory
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. Our approach is to view such models as full subcategories of categorical models of intuitionistic set theory. It is shown that the existence of solutions to recursive domain equations depends upon the strength of the se...
متن کاملComputational Soundness and Adequacy for Typed Object Calculus
By giving a translation from typed object calculus into Plotkin’s FPC, we demonstrate that every computationally sound and adequate model of FPC (with eager operational semantics), is also a sound and adequate model of typed object calculus. This establishes that denotational equality is contained in operational equivalence, i.e. that for any such model of typed object calculus, if two terms ha...
متن کامل